A characterization of convex surfaces which are $L$-sets
نویسندگان
چکیده
منابع مشابه
A New Characterization of L-Convex Polygons
In 1949 Horn and Valentine [HV] showed that if each pair of points a,b in a simple polygon P could be connected by a polygonal path of length two lying in P (such polygons are termed L-convex polygons) then through each point x in P there exists a line segment L(x) lying in P such that for every point y in P there exists a point z in L(x) with the property that the segment yz lies in P. Since t...
متن کاملWhich elements of a finite group are non-vanishing?
Let $G$ be a finite group. An element $gin G$ is called non-vanishing, if for every irreducible complex character $chi$ of $G$, $chi(g)neq 0$. The bi-Cayley graph ${rm BCay}(G,T)$ of $G$ with respect to a subset $Tsubseteq G$, is an undirected graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(tx,2)}mid xin G, tin T}$. Let ${rm nv}(G)$ be the set of all non-vanishi...
متن کاملLocal characterization of strongly convex sets
Strongly convex sets in Hilbert spaces are characterized by local properties. One quantity which is used for this purpose is a generalization of the modulus of convexity δΩ of a set Ω. We also show that limε→0 δΩ(ε)/ε 2 exists whenever Ω is closed and convex.
متن کاملNatural Color Categories Are Convex Sets
The paper presents a statistical evaluation of the typological data about color naming systems across the languages of the world that have been obtained by the World Color Survey. In a first step, we discuss a principal component analysis of the categorization data that led to a small set of easily interpretable features that are dominant in color categorization. These features were used for a ...
متن کاملWhich Data Sets are ‘Clusterable’? – A Theoretical Study of Clusterability
We investigate measures of the clusterability of data sets. Namely, ways to define how ‘strong’ or ‘conclusive’ is the clustering structure of a given data set. We address this issue with generality, aiming for conclusions that apply regardless of any particular clustering algorithm or any specific data generation model. We survey several notions of clusterability that have been discussed in th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1973
ISSN: 0002-9939
DOI: 10.1090/s0002-9939-1973-0320887-4